Exploring Maps with Greedy Navigators

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exploring maps with greedy navigators

During the last decade of network research focusing on structural and dynamical properties of networks, the role of network users has been more or less underestimated from the bird's-eye view of global perspective. In this era of global positioning system equipped smartphones, however, a user's ability to access local geometric information and find efficient pathways on networks plays a crucial...

متن کامل

Exploring Temporal Networks with Greedy Walks

Temporal networks come with a wide variety of heterogeneities, from burstiness of event sequences to correlations between timings of node and link activations. In this paper, we set to explore the latter by using greedy walks as probes of temporal network structure. Given a temporal network (a sequence of contacts), greedy walks proceed from node to node by always following the first available ...

متن کامل

Exploring the k-coloable landscape with Iterated Greedy

Many heuristic algorithms have been proposed for graph coloring. The simplest is perhaps the greedy algorithm. Many variations have been proposed for this algorithm at various levels of sophistication, but it is generally assumed that the coloring will occur in a single attempt. We note that if a new permutation of the vertices is chosen which respects the independent sets of a previous colorin...

متن کامل

Exploring Road Incident Data with Heat Maps

This research seeks to determine whether heat mapping is an effective technique for the visual exploration of road incident data. Four software prototypes, which adopted map, treemap and spatial treemap layouts, were developed using open source software. Whilst the visualization process described by Fry (2007) informed the development effort, the evaluation methodology was based on the Nested P...

متن کامل

Exploring brain connectivity with two-dimensional maps

We present and compare two low-dimensional representations, 2D point and 2D path, for tractography datasets. The goal is to facilitate the exploration of dense tractograms by reducing visual complexity both in static representation and during interaction. The proposed planar maps have desirable properties such as visual clarity, ease of tract-of-interest selection, and multiscale hierarchy. The...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review Letters

سال: 2012

ISSN: 0031-9007,1079-7114

DOI: 10.1103/physrevlett.108.128701